COMPUTINGK-TRIVIAL SETS BY INCOMPLETE RANDOM SETS
نویسندگان
چکیده
منابع مشابه
Computing K-Trivial Sets by Incomplete Random Sets
Every K-trivial set is computable from an incomplete Martin-Löf random set, i.e., a Martin-Löf random set that does not compute the halting problem. A major objective in algorithmic randomness is to understand how random sets and computably enumerable (c.e.) sets interact within the Turing degrees. At some level of randomness all interesting interactions cease. The lower and upper cones of nonc...
متن کاملPropagation Models and Fitting Them for the Boolean Random Sets
In order to study the relationship between random Boolean sets and some explanatory variables, this paper introduces a Propagation model. This model can be applied when corresponding Poisson process of the Boolean model is related to explanatory variables and the random grains are not affected by these variables. An approximation for the likelihood is used to find pseudo-maximum likelihood esti...
متن کاملK -Trivial Closed Sets and Continuous Functions
We investigate the notion of K-triviality for closed sets and continuous functions. Every K-trivial closed set contains a K-trivial real. There exists a K-trivial Π 1 class with no computable elements. For any K-trivial degree d, there is a K-trivial continuous function of degree d.
متن کاملFuzzy Sets As Strongly Consistent Random Sets
It is known that from the purely mathematical viewpoint, fuzzy sets can be interpreted as equivalent classes of random sets. This interpretations helps to teach fuzzy techniques to statisticians and also enables us to apply results about random sets to fuzzy techniques. The problem with this interpretation is that it is too complicated: a random set is not an easy notion, and classes of random ...
متن کاملSchnorr trivial sets and truth-table reducibility
We give several characterizations of Schnorr trivial sets, including a new lowness notion for Schnorr triviality based on truth-table reducibility. These characterizations allow us to see not only that some natural classes of sets, including maximal sets, are composed entirely of Schnorr trivials, but also that the Schnorr trivial sets form an ideal in the truth-table degrees but not the weak t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Bulletin of Symbolic Logic
سال: 2014
ISSN: 1079-8986,1943-5894
DOI: 10.1017/bsl.2013.3